Connected Dominating Set in Sensor Networks and MANETs
نویسندگان
چکیده
3 Centralized CDS Construction 335 3.1 Guha and Khuller’s Algorithm . . . . . . . . . . . . . . . . . . . . . 336 3.2 Ruan’s Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 338 3.3 Cheng’s Greedy Algorithm . . . . . . . . . . . . . . . . . . . . . . . . 340 3.4 Min’s Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 341 3.5 Butenko’s Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . 341
منابع مشابه
Iterative Local Solutions for Connected Dominating Sets in Ad Hoc Wireless Networks
In this paper, we propose a general framework of the iterative local solution (ILS) for computing a connected dominating set (CDS) in ad hoc wireless networks, which include mobile ad hoc networks (MANETs) and wireless sensor networks (WSNs). This approach uses an iterative application of a selected local solution. Each application of the local solution enhances the result obtained from the pre...
متن کاملA Zonal Algorithm for Clustering An Hoc Networks
A Mobile Ad Hoc Network (MANET) is an infrastructureless wireless network that can support highly dynamic mobile units. The multi-hop feature of a MANET suggests the use of clustering to simplify routing. Graph domination can be used in defining clusters in MANETs. A variant of dominating set which is more suitable for clustering MANETs is the weakly-connected dominating set. A cluster is defin...
متن کاملAn Optimal CDS Construction Algorithm with Activity Scheduling in Ad Hoc Networks
A new energy efficient optimal Connected Dominating Set (CDS) algorithm with activity scheduling for mobile ad hoc networks (MANETs) is proposed. This algorithm achieves energy efficiency by minimizing the Broadcast Storm Problem [BSP] and at the same time considering the node's remaining energy. The Connected Dominating Set is widely used as a virtual backbone or spine in mobile ad hoc network...
متن کاملA Dominating Set Based Clustering Algorithm for Mobile Ad Hoc Networks
We propose a new Connected Dominating Set (CDS) based algorithm for clustering in Mobile Ad hoc Networks (MANETs). Our algorithm is based on Wu and Li’s [14] algorithm, however we provide significant modifications by considering the degrees of the nodes during marking process and also provide further heuristics to determine the color of a node in the initial phase. We describe, analyze and meas...
متن کاملAnt colony optimization algorithm with pheromone correction strategy for the minimum connected dominating set problem
In this paper an ant colony optimization (ACO) algorithm for the minimum connected dominating set problem (MCDSP) is presented. The MCDSP become increasingly important in recent years due to its applicability to the mobile ad hoc networks (MANETs) and sensor grids. We have implemented a one-step ACO algorithm based on a known simple greedy algorithm that has a significant drawback of being easi...
متن کامل